A Tighter Analysis of Set Cover Greedy Algorithm for Test Set
نویسنده
چکیده
Set cover greedy algorithm is a natural approximation algorithm for test set problem. This paper gives a precise and tighter analysis of approximation ratio of this algorithm. The author improves the approximation ratio 2 lnn directly derived from set cover to 1.14 lnn by applying potential function technique of derandomization method. In addition, the author gives a nontrivial lower bound (1+α) lnn of approximation ratio, where α is a positive constant. This lower bound, together with the matching bound of information content heuristic, confirms the fact information content heuristic is slightly better than set cover greedy algorithm in worst case.
منابع مشابه
Automatic QoS-aware Web Services Composition based on Set-Cover Problem
By definition, web-services composition works on developing merely optimum coordination among a number of available web-services to provide a new composed web-service intended to satisfy some users requirements for which a single web service is not (good) enough. In this article, the formulation of the automatic web-services composition is proposed as several set-cover problems and an approxima...
متن کاملTighter inapproximability for set cover
Set Cover is a classic NP-hard problem; as shown by Slav́ık (1997) the greedy algorithm gives an approximation ratio of lnn− ln lnn+Θ(1). A series of works by Lund & Yannakakis (1994), Feige (1998), Moshkovitz (2015) have shown that, under the assumption P 6= NP , it is impossible to obtain a polynomial-time approximation ratio with approximation ratio (1 − α) lnn, for any constant α > 0. In thi...
متن کاملAn Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملCovering Analysis of the Greedy Algorithm for Partial Cover
The greedy algorithm is known to have a guaranteed approximation performance in many variations of the well-known minimum set cover problem. We analyze the number of elements covered by the greedy algorithm for the minimum set cover problem, when executed for k rounds. This analysis quite easily yields in the p-partial cover problem over a ground set of m elements the harmonic approximation gua...
متن کاملNote on Set Cover
Greedy: Θ(min(logd,q)): Θ(H(d)) (this also implies O(logn), n is number of elements). (Note: Feige [3] prove that there is no substantially improvement (for greedy algo).) Also O(q) and exists tight example (section 2.5); so, Θ(q) in general. Note that this bound is asymptotically tight (see Vazirani’s book [10] section 29.9) Slav́ık [9] also gives exact analysis lnn− lnlnn+Θ(1). LP Rounding: O(...
متن کامل